What (who) is total ordering - definition

In mathematics, a total or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation ${\displaystyle \leq }$ on some set ${\displaystyle X}$, which satisfies the following for all ${\displaystyle a,b}$ and ${\displaystyle c}$ in ${\displaystyle X}$:

1. ${\displaystyle a\leq a}$ (reflexive).
2. If ${\displaystyle a\leq b}$ and ${\displaystyle b\leq c}$ then ${\displaystyle a\leq c}$ (transitive).
3. If ${\displaystyle a\leq b}$ and ${\displaystyle b\leq a}$ then ${\displaystyle a=b}$ (antisymmetric).
4. ${\displaystyle a\leq b}$ or ${\displaystyle b\leq a}$ (strongly connected, formerly called total).

Reflexivity (1.) already follows from connectedness (4.), but is required explicitly by many authors nevertheless, to indicate the kinship to partial orders. Total orders are sometimes also called simple, connex, or full orders.

A set equipped with a total order is a totally ordered set; the terms simply ordered set, linearly ordered set, and loset are also used. The term chain is sometimes defined as a synonym of totally ordered set, but refers generally to some sort of totally ordered subsets of a given partially ordered set.

An extension of a given partial order to a total order is called a linear extension of that partial order.